Querying Rural Content Experts Using an Online Questionnaire

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying E-Catalogs Using Content Summaries

With the rapid development of e-services on the Web, increasing number of e-catalogs are becoming accessible to users. A large number of e-catalogs provide information about similar type of products/services. To simplify users information searching effort, data integration systems have being developed to integrate e-catalogs providing similar type of information such that users can query those ...

متن کامل

Online Clustering with Experts

Approximating the k-means clustering objective with an online learning algorithm is an open problem. We introduce a family of online clustering algorithms by extending algorithms for online supervised learning, with access to expert predictors, to the unsupervised learning setting. Instead of computing prediction errors in order to re-weight the experts, the algorithms compute an approximation ...

متن کامل

HowTo: Querying online Data

This article demonstrates how you can make use of the tools that have been provided for on-line querying of data resources. These tools rely on others (such as the NLM and NCBI) providing and documenting appropriate web interfaces. The tools described here allow you to either retrieve the data (usually in XML) or have it rendered in a browser on the local machine. To do this you will need the B...

متن کامل

Content-Based Querying

Multimedia Database Systems (MMDS) support rich data types, such as text, images, video, and sound. Queries in MMDSs may refer to the content of the stored multimedia objects. This is called content-based querying. However, manual entry of content descriptions is very difficult and subjective. A better approach is to provide automatic content-based retrieval through image, text, and sound inter...

متن کامل

Online Aggregation of Unbounded Signed Losses Using Shifting Experts

For the decision theoretic online (DTOL) setting, we consider methods to construct algorithms that suffer loss not much more than of any sequence of experts distributed along a time interval (shifting experts setting). We present a modified version of the method of Mixing Past Posteriors which uses as basic algorithm AdaHedge with adaptive learning rate. Due to this, we combine the advantages o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Online Journal of Rural Nursing and Health Care

سال: 2018

ISSN: 1539-3399

DOI: 10.14574/ojrnhc.v18i2.533